Saturating sets in projective planes and hypergraph covers
نویسندگان
چکیده
منابع مشابه
On Saturating Sets in Small Projective Geometries
A set of points, S ⊆ PG(r, q), is said to be %-saturating if, for any point x ∈ PG(r, q), there exist %+ 1 points in S that generate a subspace in which x lies. The cardinality of a smallest possible set S with this property is denoted by k(r, q, %). We give a short survey of what is known about k(r, q, 1) and present new results for k(r, q, 2) for small values of r and q. One construction pres...
متن کاملPascal-Brianchon Sets in Pappian Projective Planes Pascal-Brianchon Sets in Pappian Projective Planes
It is well-known that Pascal and Brianchon theorems characterize conics in a Pappian projective plane. But, using these theorems and their modifications we shall show that the notion of a conic (or better a Pascal-Brianchon set) can be defined without any use of theory of projectivities or of polarities as usually.
متن کاملResolving Sets and Semi-Resolving Sets in Finite Projective Planes
In a graph Γ = (V,E) a vertex v is resolved by a vertex-set S = {v1, . . . , vn} if its (ordered) distance list with respect to S, (d(v, v1), . . . , d(v, vn)), is unique. A set A ⊂ V is resolved by S if all its elements are resolved by S. S is a resolving set in Γ if it resolves V . The metric dimension of Γ is the size of the smallest resolving set in it. In a bipartite graph a semi-resolving...
متن کاملLinear nonbinary covering codes and saturating sets in projective spaces
Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...
متن کاملSpecial Point Sets in Finite Projective Planes
We consider the following three problems: 1. Let U be a q-subset of GF(q 2) with the properties 0; 1 2 U and u ? v is a square for all u; v 2 U. Does it follow that U consists of the elements of the subbeld GF(q)? Here q is odd. 2. Let f : GF(q) ! GF(q) be any function, and let be the set of diierence quotients (directions, slopes). What are the possibilities for jD f j? 3. Let B be a subset of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.01.011